A Class of Hard Small 0-1 Programs
نویسندگان
چکیده
In this paper, we consider a class of 0–1 programs which, although innocent looking, is a challenge for existing solution methods. Solving even small instances from this class is extremely difficult for conventional branch-and-bound or branch-and-cut algorithms. We also experimented with basis reduction algorithms and with dynamic programming without much success. The paper then examines the performance of two other methods: a group relaxation for 0,1 programs, and a sorting-based procedure following an idea of Wolsey. Although the results with these two methods are somewhat better than with the other four when it comes to checking feasibility, we offer this class of small 0,1 programs as a challenge to the research community. As of yet, instances from this class with as few as seven constraints and sixty 0–1 variables are unsolved.
منابع مشابه
Testing membership in the {0, 1/2}-closure is strongly NP-hard, even for polytopes contained in the n-dimensional 0/1-cube
Caprara and Fischetti introduced a class of cutting planes, called {0, 1/2}-cuts, which are valid for arbitrary integer linear programs. They also showed that the associated separation problem is strongly NPhard. We show that separation remains strongly NP-hard, even when all integer variables are binary, even when the integer linear program is a set packing problem, and even when the matrix of...
متن کاملA Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods
In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...
متن کاملجاسازی خط ویژگی وزندار برای استخراج ویژگی تصاویر ابرطیفی
One of the most preprocessing steps before the classification of hyperspectral images is supervised feature extraction. Because obtaining the training samples is hard and time consuming, the number of available training samples is limited. We propose a supervised feature extraction method in this paper that is efficient in small sample size situation. The proposed method, which is called weight...
متن کاملChapter 8 Copositive Programming
A symmetric matrix S is copositive if yT S y≥0 for all y≥0, and the set of all copositive matrices, denoted C∗, is a closed, pointed, convex cone; see [25] for a recent survey. Researchers have realized how to model many NP-hard optimization problems as copositive programs, that is, programs over C∗ for which the objective and all other constraints are linear [7, 9, 13, 16, 32–34]. This makes c...
متن کاملA smoothing heuristic for the global optimization of a class of bilinear bilevel programs
We provide a global heuristic for a class of bilevel programs with bilinear objectives and linear contraints. The algorithm relies on an interior point approach that can be seen as a combination of the smoothing and implicit programming techniques wellknown in the MPEC literature. But contrary to what is usually done, here the focus is on global optimality. We tested the algorithm on large-scal...
متن کامل